CM-triviality and relational structures

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Variants of Cm-triviality

We introduce a generalization of CM-triviality relative to a fixed invariant collection of partial types, in analogy to the Canonical Base Property defined by Pillay, Ziegler and Chatzidakis which generalizes one-basedness. We show that, under this condition, a stable field is internal to the family, and a group of finite Lascar rank has a normal nilpotent subgroup such that the quotient is alm...

متن کامل

Forking in simple theories and CM-triviality

Aquesta tesi doctoral està subjecta a la llicència Reconeixement-NoComercial – SenseObraDerivada 3.0. Espanya de Creative Commons. Esta tesis doctoral está sujeta a la licencia Reconocimiento-NoComercial – SinObraDerivada 3.0. España de Creative Commons. Als meus pares i al meu germà, per haver estat sempre al meu costat A la Mar, per estar-hi des que ens vem trobar

متن کامل

Hodge Structures of Cm-type

We show that any effective Hodge structure of CMtype occurs (without having to take a Tate twist) in the cohomology of some CM abelian variety over C. As a consequence we get a simple proof of the theorem (due to Hazama) that the usual Hodge conjecture for the class of all CM abelian varieties implies the general Hodge conjecture for the same class.

متن کامل

Tilings and Associated Relational Structures

In the present paper, as we did previously in [5], we investigate the relations between the geometric properties of tilings and the algebraic and model-theoretic properties of associated relational structures. Our study is motivated by the existence of aperiodic tilings. In [5], we considered tilings of the euclidean spaces R, and isomorphism was defined up to translation. Here, we consider, mo...

متن کامل

Rippling on Relational Structures

The rippling heuristic has been rather successfully used to guide inductive proofs in a functional framework. We present here how that heuristic can be formalized in a relational framework, more adapted to logic programming. The rippling heuristic is rst analysed to identify its key components. A formalization of these to a relational framework is then presented. The applicability and the power...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Pure and Applied Logic

سال: 2003

ISSN: 0168-0072

DOI: 10.1016/s0168-0072(03)00005-8